翻訳と辞書 Words near each other ・ Reverse transcriptase ・ Reverse Transcription Loop-mediated Isothermal Amplification ・ Reverse transcription polymerase chain reaction ・ Reverse transfection ・ Reverse triiodothyronine ・ Reverse Turing test ・ Reverse Underground Railroad ・ Reverse vaccinology ・ Reverse vending machine ・ Reverse video ・ Reverse walkthrough ・ Reverse Warburg effect ・ Reverse!? ・ Reverse, Then Forward Again ・ Reverse-contrast typefaces ・ Reverse-delete algorithm ・ Reverse-Flash ・ Reverse-flow cylinder head ・ Reverse-transcriptase inhibitor ・ Reversed bullet ・ Reversed compound agent theorem ・ Reversed electrodialysis ・ Reversed field pinch ・ Reversed Image Unlimited ・ Reversed Tse ・ Reversed Ze ・ Reversed Ze with diaeresis ・ Reversed-Field eXperiment ・ Reversed-phase chromatography ・ Reverser Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Reverse-delete algorithm ： ウィキペディア英語版 Reverse-delete algorithm The reverse-delete algorithm is an algorithm in graph theory used to obtain a minimum spanning tree from a given connected, edge-weighted graph. It first appeared in , but it should not be confused with Kruskal's algorithm which appears in the same paper. If the graph is disconnected, this algorithm will find a minimum spanning tree for each disconnected part of the graph. The set of these minimum spanning trees is called a minimum spanning forest, which contains every vertex in the graph. This algorithm is a greedy algorithm, choosing the best choice given any situation. It is the reverse of Kruskal's algorithm, which is another greedy algorithm to find a minimum spanning tree. Kruskal’s algorithm starts with an empty graph and adds edges while the Reverse-Delete algorithm starts with the original graph and deletes edges from it. The algorithm works as follows: * Start with graph G, which contains a list of edges E. * Go through E in decreasing order of edge weights. * For each edge, check if deleting the edge will further disconnect the graph. * Perform any deletion that does not lead to additional disconnection. == Pseudocode == 1 function ReverseDelete(edges 7 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Reverse-delete algorithm」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.